GATE PYQ

Data Structure

Q211.
In the worst case, the number of comparisons needed to search a single linked list of length n for a given element is

Q212.
The concatenation of two lists is to be performed on O(1) time. Which of the following implementations of a list should be used?

Q213.
For merging two sorted lists of sizes m and n into a sorted list of size m+n, we require comparisons of

Q214.
Which of the following statements is true? I. As the number of entries in a hash table increases, the number of collisions increases. II. Recursive programs are efficient III. The worst case complexity for Quicksort is O(n^2) IV. Binary search using a linear linked list is efficient

Q215.
Linked lists are not suitable data structures for which one of the following problems?

Q216.
In a circular linked list oraganisation, insertion of a record involves modification of

Q217.
Of the following, which best approximates the ratio of the number of nonterminal nodes in the total number of nodes in a complete K-ary tree of depth N ?

Q218.
A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L = 41, and I = 10, what is the value of n?

Q219.
A complete n-ary tree is one in which every node has 0 or n sons. If x is the number of internal nodes of a complete n-ary tree, the number of leaves in it is given by

Q220.
Consider the following rooted tree with the vertex labelled P as the root The order in which the nodes are visited during an in-order traversal of the tree is